Complete problems for deterministic polynomial time
نویسندگان
چکیده
منابع مشابه
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the variables in a given symbolic matrix as to maximize the resulting matrix rank. Matrix completion belongs to the fundamental problems in computational complexity with numerous important algorithmic applications, among o...
متن کاملMemcomputing NP-complete problems in polynomial time using polynomial resources
Memcomputing is a novel non-Turing paradigm of computation that uses interacting memory cells (memprocessors for short) to store and process information on the same physical platform. It was recently proven mathematically that memcomputing machines have the same computational power of nondeterministic Turing machines. Therefore, they can solve NP-complete problems in polynomial time and, using ...
متن کاملBandwidth Constraints on Problems Complete for Polynomial Time
A graph G = ( b’. El has bandwidth k under a layout L : V 4’ ’ { 1. . . . , 1 VJ} if, for all {s. y} E E. jL(x 1 -L(y)] s k. Bandwidth constraints on several problems that are complete for [Fp (under log space reductions) are considered. In particular, the solvable path system problem and the and/or graph accessibility problem under various bandwidth constraints are used to prove results about ...
متن کاملProblems Complete for Deterministic Logarithmic Space
* We exhibit several problems complete for deterministic logarithmic space under NC' (i.e., log depth) reducibility. The list includes breadth-first search and depth-first search of an undirected tree, connectivity of undirected graphs known to be made up of one or more disjoint cycles, undirected graph acyclicity, and several problems related to representing and to operating with permutations ...
متن کاملDeterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
Due to their fundamental nature and numerous applications, sphere constrained polynomial optimization problems have received a lot of attention lately. In this paper, we consider three such problems: (i) maximizing a homogeneous polynomial over the sphere; (ii) maximizing a multilinear form over a Cartesian product of spheres; and (iii) maximizing a multiquadratic form over a Cartesian product ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1976
ISSN: 0304-3975
DOI: 10.1016/0304-3975(76)90068-2